Escher's Combinatorial Patterns
نویسندگان
چکیده
منابع مشابه
Escher's combinatorial patterns
It is a little-known fact that M. C. Escher posed and answered some combinatorial questions about patterns produced in an algorithmic way. We report on his explorations, indicate how close he came to the correct solutions, and pose an analogous problem in 3 dimensions. In the years 1938-1942, the Dutch graphic artist M. C. Escher developed what he called his "layman's theory" on regular divisio...
متن کاملEfficiently Listing Combinatorial Patterns in Graphs
Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since the early days of computer science. Some of these problems consider substructures of a graph that have certain properties. These substructures of interest, generally called patterns, are often meaningful in the domain ...
متن کاملEpigenetic Combinatorial Patterns Predict Disease Variants
Most genetic variants identified in genome-wide association studies are noncoding and are likely tagging nearby causal variants. It is a challenging task to pinpoint the precise locations of disease-causal variants and understand their functions in disease. A promising approach to improve fine mapping is to integrate the functional data currently available on hundreds of human tissues and cell ...
متن کاملCombinatorial enumeration of 2×2 ribbon patterns
An algorithm for creating repeating patterns from a single decorated square gives rise to an obvious combinatorial question: How many different patterns can be created, following the rules? Answers vary according to the definition of equivalence of patterns, and computer sorting programs can provide numerical answers. But algebraic techniques give insight into the answers and provide general fo...
متن کاملCRT and Fixed Patterns in Combinatorial Sequences
In this paper, new context of Chinese Remainder Theorem (CRT) based analysis of combinatorial sequence generators has been presented. CRT is exploited to establish fixed patterns in LFSR sequences and underlying cyclic structures of finite fields. New methodology of direct computations of DFT spectral points in higher finite fields from known DFT spectra points of smaller constituent fields is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1996
ISSN: 1077-8926
DOI: 10.37236/1332